The Generality Constraint and Categorial Restrictions
نویسنده
چکیده
We should not admit categorial restrictions on the significance of syntactically well formed strings. Syntactically well formed but semantically absurd strings, such as ‘Life’s but a walking shadow’ and ‘Caesar is a prime number’, can express thoughts; and competent thinkers both are able to grasp these and ought to be able to. Gareth Evans’ generality constraint, though Evans himself restricted it, should be viewed as a fully general constraint on concept possession and propositional thought. For (a) even well formed but semantically cross-categorial strings often do possess substantive inferential roles; (b) hearers exploit these inferential roles in interpreting such strings metaphorically; (c) there is no good reason to deny truth-conditions to strings with inferential roles.
منابع مشابه
Categorial Semantics and Scoping
Certain restrictions on possible scopings of quantified noun phrases in natural language are usually expressed in terms of formal constraints on binding at a level of logical form. Such reliance on the form rather than the content of semantic interpretations goes against the spirit of compositionality. I will show that those scoping restrictions follow from simple and fundamental facts about fu...
متن کاملIncremental Interpretation and Combinatory Categorial Grammar
The paper is organised around a particular problem of ana phoric definite reference. A solution to this problem requires sen tence processing which allows semantic representations to be evaluated incrementally, as a phrase is read from left to right. The paper shows how a proposal made by Mellish (1985), to regard incremental semantic evaluation as a constraint satisfaction task, can provide ...
متن کاملTowards a Constraint Parser for Categorial Type Logics
This thesis shows how constraint programming can be applied to the processing of Categorial Type Logics (CTL). It presents a novel formalisation of the parsing task for categorial grammars as a tree configuration problem, and demonstrates how a recent proposal for structural constraints on CTL parse trees [11] can be integrated into this framework. The resulting processing model has been implem...
متن کاملA constraint-programming approach to parsing with resource-sensitive categorial grammar
Parsing with resource-sensitive categorial grammars (up to the LambekVan Benthem calculus LP) is an NP-complete problem. The traditional approach to parsing with such grammars is based on generate & test and cannot avoid this high worst-case complexity. This paper proposes an alternative approach, based on constraint programming: Given a grammar, constraints formulated on an abstract interpreta...
متن کاملMulti-modal combinatory categorial grammar
The paper shows how Combinatory Categorial Grammar (CCG) can be adapted to take advantage of the extra resourcesensitivity provided by the Categorial Type Logic framework. The resulting reformulation, Multi-Modal CCG, supports lexically specified control over the applicability of combinatory rules, permitting a universal rule component and shedding the need for language-specific restrictions on...
متن کامل